package com.andnnl.minPath;

/**
 * Created by chenss on 2021/4/28.
 */
public class MinPathTest {
    public static void main(String[] args) {
        Solution s =new Solution();
        int[][] grid = {{1,3,1},{1,5,1},{4,2,1}};
        System.out.println(s.minPathSum(grid));
    }
}

class Solution {
    public int minPathSum(int[][] grid) {
        int m = grid.length;
        int n = grid[0].length;
        int[][] dp = new int[m][n];
        dp[0][0] = grid[0][0];
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                if (i == 0 || j == 0) {
                    if (i == 0 && j != 0) {
                        dp[i][j] = dp[i][j - 1] + grid[i][j];
                    } else if (i != 0 && j == 0) {
                        dp[i][j] = dp[i - 1][j] + grid[i][j];
                    }
                } else {
                    dp[i][j] = Math.min(dp[i - 1][j], dp[i][j - 1]) + grid[i][j];
                }
            }
        }
        return dp[m - 1][n - 1];
    }
}
